Detecting Infeasibility and Generating Cuts for MIP using CP
نویسندگان
چکیده
We study a hybrid MIP/CP solution approach in which CP is used for detecting infeasibilities and generating cuts within a branch-and-cut algorithm for MIP. Our framework applies to MIP problems augmented by monotone constraints that can be handled by CP. We illustrate our approach on a generic multiple machine scheduling problem, and compare it to other hybrid MIP/CP algorithms.
منابع مشابه
Numerically Safe Gomory Mixed-Integer Cuts
W describe a simple process for generating numerically safe cutting planes using floating-point arithmetic and the mixed-integer rounding procedure. Applying this method to the rows of the simplex tableau permits the generation of Gomory mixed-integer cuts that are guaranteed to be satisfied by all feasible solutions to a mixed-integer programming problem (MIP). We report on tests with the MIPL...
متن کاملA Method for Solving Super-Efficiency Infeasibility by Adding virtual DMUs with Mean Values
Using super-efficiency, with regard to ranking efficient units, is increasing in DEA. However, this model has some problems such as the infeasibility. Thus, this article studies infeasibility of the input-based super-efficiency model (because of the zero inputs and outputs), and presents a solution by adding two virtual DMUs with mean values (one for inputs and one for outputs). Adding virtual ...
متن کاملNew stopping criteria for detecting infeasibility in conic optimization
Detecting infeasibility in conic optimization and providing certificates for infeasibility pose a bigger challenge than in the linear case due to the lack of strong duality. In this paper we generalize the approximate Farkas lemma of Todd and Ye [12] from the linear to the general conic setting, and use it to propose stopping criteria for interior point algorithms using self-dual embedding. The...
متن کاملComputing with Multi-Row Intersection Cuts
Cutting planes are one of the main techniques currently used to solve large-scale MixedInteger Linear Programming (MIP) models. Many important cuts used in practice, such as Gomory Mixed-Integer (GMI) cuts, are obtained by solving the linear relaxation of the MIP, extracting a single row of the simplex tableau, then applying integrality arguments to it. A natural extension, which has received r...
متن کاملOn the interplay of Mixed Integer Linear, Mixed Integer Nonlinear and Constraint Programming
In this thesis we study selected topics in the field of Mixed Integer Programming (MIP), in particular Mixed Integer Linear and Nonlinear Programming (MI(N)LP). We set a focus on the influences of Constraint Programming (CP). First, we analyze Mathematical Programming approaches to water network optimization, a set of challenging optimization problems frequently modeled as nonconvex MINLPs. We ...
متن کامل